Dynamic Offline Conflict-Free Coloring for Unit Disks
نویسندگان
چکیده
A conflict-free coloring for a given set of disks is a coloring of the disks such that for any point p on the plane there is a disk among the disks covering p having a color different from that of the rest of the disks that covers p. In the dynamic offline setting, a sequence of disks is given, we have to color the disks one-by-one according to the order of the sequence and maintain the conflict-free property at any time for the disks that are colored. This paper focuses on unit disks, i.e., disks with radius one. We give an algorithm that colors a sequence of n unit disks in the dynamic offline setting using O(log n) colors. The algorithm is asymptotically optimal because Ω(logn) colors is necessary to color some set of n unit disks for any value of n [9].
منابع مشابه
Coloring intersection hypergraphs of pseudo-disks
We prove that the intersection hypergraph of a family of n pseudo-disks with respect to another family of pseudo-disks admits a proper coloring with 4 colors and a conflict-free coloring with O(log n) colors. Along the way we prove that the respective Delaunay-graph is planar. We also prove that the intersection hypergraph of a family of n regions with linear union complexity with respect to a ...
متن کاملConflict-Free Coloring of Intersection Graphs
A conflict-free k-coloring of a graph G = (V,E) assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among v and v’s neighbors. Such colorings have applications in wireless networking, robotics, and geometry, and are well studied in graph theory. Here we study the conflictfree coloring of geometric inter...
متن کاملConflict-free coloring of unit disks
Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call Minimum Conflict-Free Coloring (Min-CF-Coloring). In its general form, the input of the Min-CF-coloring problem is a set system (X;S), where each S 2 S is a subset of X . The output is a coloring of the sets in S that satisfies the following constraint: for every x 2 X th...
متن کاملDynamic Conflict-Free Colorings in the Plane
We study dynamic conflict-free colorings in the plane, where the goal is to maintain a conflict-free coloring (CF-coloring for short) under insertions and deletions. First we consider CF-colorings of a set S of unit squares with respect to points. Our method maintains a CF-coloring that uses O(logn) colors at any time, where n is the current number of squares in S, at the cost of only O(logn) r...
متن کاملConflict-free Colorings
Motivated by a frequency assignment problem in cellular telephone networks, Even et al. studied the following question. Given a set P of n points in general position in the plane, what is the smallest number of colors in a coloring of the elements of P with the property that any closed disk D with D ∩ P 6= ∅ has an element whose color is not assigned to any other element of D ∩ P . We refer to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008